Membership Equational Logic, Calculus of Inductive Constructions, and Rewrite Logic (Extended Abstract)
نویسندگان
چکیده
منابع مشابه
Membership Equational Logic, Calculus of Inductive Constructions, and Rewrite Logic 1 Extended Abstract
This paper is part of a long-term eeort to increase expressiveness of speciication languages while at the same time having a Curry-Howard semantic basis on which three major tools can be based, namely eecient execution by rewriting, powerful interactive and automated theorem-proving environments, and extraction of provably correct code from speciications. This eeort is conducted within the rese...
متن کاملAbstract Derivations, Equational Logic and Interpolation (extended Abstract)
derivations, equational logic and interpolation (extended abstract) Gerard R. Renardel de Lavalette Department of Mathematics and Computing Science University of Groningen, the Netherlands Abstract. We define abstract derivations for equational logic and use them to prove the interpolation property. We define abstract derivations for equational logic and use them to prove the interpolation prop...
متن کاملReflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
We show that the generalized variant of formal systems where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These resu...
متن کاملSpeciication and Proof in Membership Equational Logic
This paper is part of a long term eeort to increase expres-siveness of algebraic speciication languages while at the same time having a simple semantic basis on which eecient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been eeciently implemented. M...
متن کاملSpecification and Proof in Membership Equational Logic
Abs t rac t This paper is part of a long-term effort to increase expressiveness of algebraic specification languages while at the same time having a simple semantic basis on which efficient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80024-6